Compacting frequent star patterns in RDF graphs
نویسندگان
چکیده
منابع مشابه
Using Patterns for Keyword Search in RDF Graphs
An increasing number of RDF datasets are available on the Web. Querying RDF data requires the knowledge of a query language such as SPARQL; it also requires some information describing the content of these datasets. The goal of our work is to facilitate the querying of RDF datasets, and we present an approach for enabling users to search in RDF data using keywords. We introduce the notion of pa...
متن کاملRDF Twig: accessing RDF graphs in XSLT
RDF is a powerful, standard way to represent metadata. XSLT is a powerful, standard way to transform documents. Unfortunately, it isn’t particularly easy to transform RDF graphs with XSLT. This paper describes a new strategy for making RDF amenable to XSLT processing. It introduces RDF Twig, a set of extension functions for Saxon and Xalan that provide a flexible methodology for accessing RDF g...
متن کاملTrust in RDF Graphs
It is well-known that pure Resource Description Framework (RDF) is not suitable to represent trust information. This work is to overcome these limitations. In our proposal RDF graphs are extended by trust metrics. The paper describes a mechanism for representing and reasoning with trust annotated RDF data. We present how with metric algebra such an annotation can be used for processing data on ...
متن کاملMining Frequent Neighborhood Patterns in Large Labeled Graphs
Over the years, frequent subgraphs have been an important sort of targeted patterns in the pattern mining literatures, where most works deal with databases holding a number of graph transactions, e.g., chemical structures of compounds. These methods rely heavily on the downwardclosure property (DCP) of the support measure to ensure an efficient pruning of the candidate patterns. When switching ...
متن کاملOn Finding Frequent Patterns in Directed Acyclic Graphs
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences (“traces”) among all paths in the graph (of some maximum length m). Since the number of paths can be huge, we propose novel algorithms whose time complexity depends only on the size of the graph, and on the relative frequency ε of the most frequent traces. In addition, we app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Information Systems
سال: 2020
ISSN: 0925-9902,1573-7675
DOI: 10.1007/s10844-020-00595-9